Transversal numbers of uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Transversal numbers of uniform hypergraphs
The transversal number ~(H) of a hypergraph H is the minimum eardinality of a set of vertices that intersects all edges of H. For k ~ 1 define ck = supz(H)/(ra + n), where H ranges over all k-uniform hypergraphs with n vertices and m edges. Applying probabilistic arguments we show that ck = (1 + o ( 1 ) ) ~ , r . This settles a problem of Tuza. t ~
متن کاملAn upper bound for the transversal numbers of 4-uniform hypergraphs
The main purpose of this paper is to prove that if H is a 4-uniform hypergraph with n vertices and m edges, then the transversal number r(H) <2(m +n)/9. All standard terminology of hypergraphs is from [ 11. Suppose H = (V, E) is a k-uniform hypergraph with n vertices and m edges. Tuza [2] proposed the problem of finding an upper bound for the transversal number r(H), of the form t(H) < ck(n + m...
متن کاملEquality of domination and transversal numbers in hypergraphs
The domination number γ(H) and the transversal number τ(H) (also called vertex covering number) of a hypergraph H are defined analogously to those of a graph. A hypergraph is of rank k if each edge contains at most k vertices. The inequality τ(H) ≥ γ(H) is valid for every hypergraph H without isolated vertices. We study the structure of hypergraphs satisfying τ(H) = γ(H), moreover prove that th...
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملOn Ramsey numbers of uniform hypergraphs with given maximum degree
For every > 0 and every positive integers Δ and r , there exists C = C( ,Δ, r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V (H)|1+ . © 2006 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 1990
ISSN: 0911-0119,1435-5914
DOI: 10.1007/bf01787474